A generalized global alignment algorithm
نویسندگان
چکیده
منابع مشابه
A generalized global alignment algorithm
MOTIVATION Homologous sequences are sometimes similar over some regions but different over other regions. Homologous sequences have a much lower global similarity if the different regions are much longer than the similar regions. RESULTS We present a generalized global alignment algorithm for comparing sequences with intermittent similarities, an ordered list of similar regions separated by d...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملgpaligner: a fast algorithm for global pairwise alignment of dna sequences
bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. many computational algorithms have been applied for solving the sequence alignment problem. dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods applied t...
متن کاملFOGSAA: Fast Optimal Global Sequence Alignment Algorithm
In this article we propose a Fast Optimal Global Sequence Alignment Algorithm, FOGSAA, which aligns a pair of nucleotide/protein sequences faster than any optimal global alignment method including the widely used Needleman-Wunsch (NW) algorithm. FOGSAA is applicable for all types of sequences, with any scoring scheme, and with or without affine gap penalty. Compared to NW, FOGSAA achieves a tim...
متن کاملA Generalized LCS Algorithm and Its Application to Corpus Alignment
The paper addresses the problem of text variation which often hinders interoperable use or reuse of corpora and annotations. A systematic solution is presented based on a variation of Longest Common Sequence algorithm. An empirical experiment with 20 full text articles shows it works well with a real world application.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2003
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/19.2.228